Coding and decoding for time-discrete amplitude-continuous memoryless channels

نویسنده

  • Jacob Ziv
چکیده

In this report we consider some aspects of the general problem of encoding and decoding for time-discrete, amplitude-continuous memoryless channels. The results can be summarized under three main headings. 1. Signal Space Structure: A scheme for constructing a discrete signal space, for which sequential encoding-decoding methods are possible for the general continuous memoryless channel, is described. We consider random code selection from a finite ensemble. The engineering advantage is that each code word is sequentially generated from a small number of basic waveforms. The effects of these signal-space constraints on the average probability of error, for different signal-power constraints, are also discussed. 2. Decoding Schemes: The application of sequential decoding to the continuous asymmetric channel is discussed. A new decoding scheme for convolutional codes, called successive decoding, is introduced. This new decoding scheme yields a bound on the average number of decoding computations for asymmetric channels that is tighter than has yet been obtained for sequential decoding. The corresponding probabilities of error of the two decoding schemes are also discussed. 3. Quantization at the Receiver: We consider the quantization at the receiver, and its effects on probability of error and receiver complexity. 1963 _ I___ _I __ _I__ I _ __ _ I

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity, mutual information, and coding for finite-state Markov channels

The Finite-State Markov Channel (FSMC) is a discrete time-varying channel whose variation is determined by a finite-state Markov process. These channels have memory due to the Markov channel variation. We obtain the FSMC capacity as a function of the conditional channel state probability. We also show that for i.i.d. channel inputs, this conditional probability converges weakly, and the channel...

متن کامل

Capacity, Mutual Information, and Coding for Finite-State Markov Channels - Information Theory, IEEE Transactions on

AbstructThe Finite-State Markov Channel (FSMC) is a discrete time-varying channel whose variation is determined by a finite-state Markov process. These channels have memory due to the Markov channel variation. We obtain the FSMC capacity as a function of the conditional channel state probability. We also show that for i.i.d. channel inputs, this conditional probability converges weakly, and the...

متن کامل

An Iterative Algorithm for Computing the Optimal Exponent of Correct Decoding Probability for Rates below the Rate Distortion Function

The form of Dueck and Körner’s exponent function for correct decoding probability for discrete memoryless channels at rates above the capacity is similar to the form of Csiszár and Körner’s exponent function for correct decoding probability in lossy source coding for discrete memoryless sources at rates below the rate distortion function. We recently gave a new algorithm for computing Dueck and...

متن کامل

On information rates for mismatched decoders

Reliable transmission over a discrete-time memoryless channel with a decoding metric that is not necessarily matched to the channel (mismatched decoding) is considered. I t is assumed that the encoder knows both the true channel and the decoding metric. The lower bound on the highest achievable rate found by Csiszar and Komer and by Hui for DMC’s, hereafter denoted C,,, is shown to bear some in...

متن کامل

Time-Splitting Multiple-Access

It is shown that the encoding/decoding problem for any asynchronous M -user memoryless multiple-access channel can be reduced to corresponding problems for at most 2M 1 single-user memoryless channels. This is done via a method called time-splitting multiple-access which is closely related to a recently developed method called rate-splitting multiple access. It is also related to to multilevel ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IRE Trans. Information Theory

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1962